Knightian Analysis of the VCG Mechanism in Unrestricted Combinatorial Auctions
نویسندگان
چکیده
We consider auctions in which the players have very limited knowledge about their own valuations. Specifically, the only information that a Knightian player i has about the profile of true valuations, θ∗, consists of a set of distributions, from one of which θ∗ i has been drawn. The VCG mechanism guarantees very high social welfare both in singleand multi-good auctions, so long as Knightian players do not select strategies that are dominated. With such Knightian players, however, we prove that the VCG mechanism guarantees very poor social welfare in unrestricted combinatorial auctions. ar X iv :1 40 3. 64 10 v1 [ cs .G T ] 2 5 M ar 2 01 4
منابع مشابه
Knightian Robustness from Regret Minimization
We consider auctions in which the players have very limited knowledge about their own valuations. Specifically, the only information that a Knightian player i has about the profile of true valuations, θ∗, consists of a set of distributions, from one of which θ∗ i has been drawn. We analyze the social-welfare performance of the VCG mechanism, for unrestricted combinatorial auctions, when Knighti...
متن کاملThe Knightian Truthfulness of Classical Mechanisms
We study mechanisms where a player’s strategy is one of his possible (payoff) types and at least one player is Knightian, that is, cannot distinguish which element of a “candidate set” with multiple types is his true type. We call such a mechanism Knightian truthful if, in all its rational plays, every player reports his own true type, if he knows it exactly, and a type in his candidate set, if...
متن کاملRevenue in Truly Combinatorial Auctions and Adversarial Mechanism Design
Little is known about generating revenue in unrestricted combinatorial auctions. (In particular, the VCG mechanism has no revenue guarantees.) In this paper we determine how much revenue can be guaranteed in such auctions. Our analysis holds both in the standard model, when all players are independent and rational, as well as in a most adversarial model, where some players may bid collusively o...
متن کاملEfficient Iterative Combinatorial Auctions
This survey considers the following setting. A seller wants to sell a set of indivisible goods. A set of buyers are interested in buying the goods. Buyers have private values for bundles of goods they are interested in buying. The seller’s objective is to allocate the goods to the buyers efficiently (maximizing the total utility of buyers). Since the values of buyers are private information, th...
متن کاملMethods for Boosting Revenue in Combinatorial Auctions
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pure economic approach of attempting to characterize the optimal auction, we explore techniques for automatically modifying existing mechanisms in a way that increase expected revenue. We introduce a general family of au...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1403.6410 شماره
صفحات -
تاریخ انتشار 2014